Quasiprobability decompositions with reduced sampling overhead

نویسندگان

چکیده

Abstract Quantum error-mitigation techniques can reduce noise on current quantum hardware without the need for fault-tolerant error correction. For instance, quasiprobability method simulates a noise-free computer using noisy one, with caveat of only producing correct expected values observables. The cost this mitigation technique manifests as sampling overhead which scales exponentially in number corrected gates. In work, we present an algorithm based mathematical optimization that aims to choose decomposition noise-aware manner. This directly leads significantly lower basis compared existing approaches. A key element novel is robust allows tradeoff between approximation and via semidefinite programming.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reduced Decompositions of Matchings

We give a characterization of matchings in terms of the canonical reduced decompositions. As an application, the canonical reduced decompositions of 12312avoiding matchings are obtained. Based on such decompositions, we find a bijection between 12312-avoiding matchings and ternary paths.

متن کامل

Reduced decompositions and permutation patterns

Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of pattern containment. These techniques are used to prove a new characterization of vexillary permutations in terms of their principal dual order ideals in a ...

متن کامل

Bijective Combinatorics of Reduced Decompositions

We study the bijective combinatorics of reduced words. These are fundamental objects in the study of Coxeter groups. We restrict our focus to reduced words of permutations and signed permutations. Our results can all be situated within the context of two parallels. The first parallel is between the enumerative theory of reduced words and that of Coxeter group elements. The second parallel is be...

متن کامل

The Combinatorics of Reduced Decompositions

This thesis examines several aspects of reduced decompositions in finite Coxeter groups. Effort is primarily concentrated on the symmetric group, although some discussions are subsequently expanded to finite Coxeter groups of types B and D. In the symmetric group, the combined frameworks of permutation patterns and reduced decompositions are used to prove a new characterization of vexillary per...

متن کامل

On Discrete Quasiprobability Distributions

Due to the recent development of hardware facilities, the description of the state and evolution of the wave processes has also evolved. In addition to the configuration space description and Fourier analysis, it has now become possible to use the Quasiprobability distributions that describe the state of the wave process in phase space of the corresponding mechanical system. By wave process we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: npj Quantum Information

سال: 2022

ISSN: ['2056-6387']

DOI: https://doi.org/10.1038/s41534-022-00517-3